Mulitlanguage First Order Theories of Propositional Attitudes
نویسندگان
چکیده
can thus restrict ourselves to normal form deductions. The proof is again by induction on the length of the deduction. All the deductions not involving R down and R up are trivially translated and not considered. As we are considering normal form deductions , we cannot have branches with applications of R up before the application of R down. Moreover, since all the deductions start from wws of index and end with a ww with index , there must be a branch where the application of R down must be followed by the
منابع مشابه
From Logic Programming Semantics to the Consistency of Syntactical Treatments of Knowledge and Belief
This paper concerns formal theories for reasoning about the knowledge and belief of agents. It has seemed attractive to researchers in artificial intelligence to formalise these propositional attitudes as predicates of first-order predicate logic. This allows the agents to express stronger introspective beliefs and engage in stronger meta-reasoning than in the classical modal operator approach....
متن کاملElement of justification in contemporary epistemology
The definition of propositional knowledge has been said to be: "knowledge is belief in justified truth" and belief, truth, and justified are necessary and adequate conditions in the actualization of knowledge. Many faults have been directed towards this three elemental definition, which some of them have been derived from the element of justification. This article reviews some of the most im...
متن کاملIntentional Paradoxes and an Inductive Theory of Propositional Quantification
Quantification over propositions is a necessary component of any theory of attitudes capable of providing a semantics of attitude ascriptions and a sophisticated system of reasoning about attitudes. There appear to be two general approaches to propositional quantification. One is developed within a first order quantificational language, the other in the language of higher order logic. The first...
متن کاملCompact Propositional Encoding of First-Order Theories
In this paper we present polynomial-time algorithms that translate First-Order Logic (FOL) theories to smaller propositional encodings than achievable before in polynomial time. For example, we can sometimes reduce the number of propositions to O(|P | + |C|), or O(|P | · log |P |), for |P | predicates of arity k and |C| constant symbols. The guarantee depends on availability of some graphical s...
متن کاملKnowledge Base Reformation: Preparing First-Order Theories for Efficient Propositional Reasoning
We present an approach to knowledge compilation that transforms a function-free first-order Horn knowledge base to propositional logic. This form of compilation is important since the most efficient reasoning methods are defined for propositional logic, while knowledge is most conveniently expressed within a first-order language. To obtain compact propositional representations, we employ techni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991